Simulating Without Negation
نویسندگان
چکیده
Although negation-free languages are widely used in logic and computer science, relatively little is known about their expressive power. To address this issue we consider kinds of non-symmetric bisimulations called directed simulations, and use these to analyse the expressive power and model theory of negation-free modal and temporal languages. We first use them to obtain preservation, safety and definability results for a simple negation-free modal language. We then obtain analogous results for stronger negation-free languages. Finally, we extend our methods to deal with languages with non-Boolean negation.
منابع مشابه
How do we get negation without symbols?
Traditionally, negation has been viewed as a symbolic process. In this two-step account, a negation operator is applied to the affirmative version of a sentence to construct the negated form. However, a recent model (Huette and Anderson 2012) has demonstrated that negation can be processed by a simple recurrent network trained to simulate sensory information when given linguistic input. While t...
متن کاملCombinatory Logic and - Calculus for Classical Logic
Since Gri n's work in 1990, classical logic has been an attractive target for extracting computational contents. However, the classical principle used in Gri n's type system is the double-negation-elimination rule, which prevents one to analyze the intuitionistic part and the purely classical part separately. By formulating a calculus with J (for the elimination rule of falsehood) and P (for Pe...
متن کاملResiduated fuzzy logics with an involutive negation
Residuated fuzzy logic calculi are related to continuous t-norms, which are used as truth functions for conjunction, and their residua as truth functions for implication. In these logics, a negation is also definable from the implication and the truth constant 0, namely ¬φ isφ → 0. However, this negation behaves quite differently depending on the t-norm. For a nilpotent t-norm (a t-norm which i...
متن کاملComplexity of the Stable Model Semantics for Queries on Incomplete Databases
We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with negation under the stable model semantics. We consider both possible and certain answers and both closedand open-world interpretation of C-databases with and without conditions. By reduction to stable models of logic programs we...
متن کاملNearly every normal modal logic is paranormal
An overcomplete logic is a logic that ‘ceases to make the difference’: According to such a logic, all inferences hold independently of the nature of the statements involved. A negation-inconsistent logic is a logic having at least one model that satisfies both some statement and its negation. A negation-incomplete logic has at least one model according to which neither some statement nor its ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 7 شماره
صفحات -
تاریخ انتشار 1997